-
1 аксиома выбора
аксиома выявленного предпочтения, сильная — strong axiom of revealed preference (SA)
Сильная аксиома выявленных предпочтений для функций спроса эквивалентна существованию рационализирующих предпочтений. — The strong axiom of revealed preferences for demand functions is equivalent to the existence of rationalizing preferences.
Russian-English Dictionary "Microeconomics" > аксиома выбора
-
2 аксиома выбора
axiom of choice; axiom of selection -
3 аксиома выбора
axiom of choice, axiom of selectionРусско-английский научно-технический словарь Масловского > аксиома выбора
-
4 аксиома выбора
1) Mathematics: AC (axiom of choice), Zorn theorem, axiom of choice, the axiom of choice2) Information technology: axiom of selection3) Makarov: axiom choice -
5 выбор
m. choice, selection, option, sampling;
выбор решения - decision making;
выбор без возвращения - sampling without replacement;
случайный выбор - random sampling;
простой случайный выбор - simple sampling;
пристрастный выбор - biased sampling;
аксибма выбора - axiom of choice;
теория выбора - decision theory;
функция выбора - choice function;
выбор главных элементов - pivoting -
6 выбор
m.choice, selection, option, sampling
См. также в других словарях:
Axiom of choice — This article is about the mathematical concept. For the band named after it, see Axiom of Choice (band). In mathematics, the axiom of choice, or AC, is an axiom of set theory stating that for every family of nonempty sets there exists a family of … Wikipedia
axiom of choice — Math. the axiom of set theory that given any collection of disjoint sets, a set can be so constructed that it contains one element from each of the given sets. Also called Zermelo s axiom; esp. Brit., multiplicative axiom. * * * ▪ set theory… … Universalium
Choice function — A choice function (selector, selection) is a mathematical function f that is defined on some collection X of nonempty sets and assigns to each set S in that collection some element f(S) of S. In other words, f is a choice function for X if and… … Wikipedia
Luce's choice axiom — DOI and citation tidying.In probability theory, Luce s choice axiom, formulated by R. Duncan Luce (1959), states that the probability of selecting one item over another from a pool of many items is not affected by the presence or absence of other … Wikipedia
Finite set — In mathematics, a set is called finite if there is a bijection between the set and some set of the form {1, 2, ..., n} where n is a natural number. (The value n = 0 is allowed; that is, the empty set is finite.) An infinite set is a set which is… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Paracompact space — In mathematics, a paracompact space is a topological space in which every open cover admits a locally finite open refinement. Paracompact spaces are sometimes also required to be Hausdorff. Paracompact spaces were introduced by Dieudonné (1944).… … Wikipedia
Game theory — is a branch of applied mathematics that is used in the social sciences (most notably economics), biology, engineering, political science, computer science (mainly for artificial intelligence), and philosophy. Game theory attempts to… … Wikipedia
Arthur Rubin — Arthur Leonard Rubin (born 1956) is an American mathematician who has earned a place among the five top ranked undergraduate competitors (who are themselves not ranked against each other) in the William Lowell Putnam Competition four times… … Wikipedia
Binomial coefficient — The binomial coefficients can be arranged to form Pascal s triangle. In mathematics, binomial coefficients are a family of positive integers that occur as coefficients in the binomial theorem. They are indexed by two nonnegative integers; the… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia